|
In mathematics, a linear combination is an expression constructed from a set of terms by multiplying each term by a constant and adding the results (e.g. a linear combination of ''x'' and ''y'' would be any expression of the form ''ax'' + ''by'', where ''a'' and ''b'' are constants). The concept of linear combinations is central to linear algebra and related fields of mathematics. Most of this article deals with linear combinations in the context of a vector space over a field, with some generalizations given at the end of the article. == Definition== Suppose that ''K'' is a field (for example, the real numbers) and ''V'' is a vector space over ''K''. As usual, we call elements of ''V'' ''vectors'' and call elements of ''K'' ''scalars''. If ''v''1,...,''v''''n'' are vectors and ''a''1,...,''a''''n'' are scalars, then the ''linear combination of those vectors with those scalars as coefficients'' is : There is some ambiguity in the use of the term "linear combination" as to whether it refers to the expression or to its value. In most cases the value is emphasized, like in the assertion "the set of all linear combinations of ''v''1,...,''v''''n'' always forms a subspace". However, one could also say "two different linear combinations can have the same value" in which case the expression must have been meant. The subtle difference between these uses is the essence of the notion of linear dependence: a family ''F'' of vectors is linearly independent precisely if any linear combination of the vectors in ''F'' (as value) is uniquely so (as expression). In any case, even when viewed as expressions, all that matters about a linear combination is the coefficient of each ''v''''i''; trivial modifications such as permuting the terms or adding terms with zero coefficient do not give distinct linear combinations. In a given situation, ''K'' and ''V'' may be specified explicitly, or they may be obvious from context. In that case, we often speak of ''a linear combination of the vectors'' ''v''1,...,''v''''n'', with the coefficients unspecified (except that they must belong to ''K''). Or, if ''S'' is a subset of ''V'', we may speak of ''a linear combination of vectors in S'', where both the coefficients and the vectors are unspecified, except that the vectors must belong to the set ''S'' (and the coefficients must belong to ''K''). Finally, we may speak simply of ''a linear combination'', where nothing is specified (except that the vectors must belong to ''V'' and the coefficients must belong to ''K''); in this case one is probably referring to the expression, since every vector in ''V'' is certainly the value of some linear combination. Note that by definition, a linear combination involves only finitely many vectors (except as described in Generalizations below). However, the set ''S'' that the vectors are taken from (if one is mentioned) can still be infinite; each individual linear combination will only involve finitely many vectors. Also, there is no reason that ''n'' cannot be zero; in that case, we declare by convention that the result of the linear combination is the zero vector in ''V''. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「linear combination」の詳細全文を読む スポンサード リンク
|